在医学成像中，表面注册广泛用于进行解剖结构之间的系统比较，其中一个很好的例子是高度复杂的脑皮质表面。为了获得有意义的注册，一种共同的方法是识别表面上的突出特征，并使用编码为具有里程碑意义的约束的特征对应关系来建立它们之间的较低距离映射。先前的注册工作主要集中于使用手动标记的地标并解决高度非线性优化问题，这些问题是耗时的，因此阻碍了实际应用。在这项工作中，我们提出了一个新的框架，用于使用准融合形式的几何形状和卷积神经网络自动地标检测和注册脑皮质表面。我们首先开发了一个具有里程碑意义的检测网络（LD-NET），该网络允许根据表面几何形状自动提取具有标志性的曲线的地标曲线。然后，我们利用检测到的地标和准符号理论来实现表面登记。具体而言，我们开发了一个系数预测网络（CP-NET），用于预测与所需地标的注册相关的Beltrami系数和一个称为磁盘Beltrami求解器网络（DBS-net）的映射网络，用于从预测的Quasi-grom-grom-groun Beltrami系数，具有准符号理论所保证的徒。提出了实验结果，以证明我们提出的框架的有效性。总的来说，我们的工作为基于表面的形态计算和医学形态分析铺平了一种新方法。

组合推荐人（CR）系统一次在结果页面中一次将项目列表馈送给用户，其中用户行为受到上下文信息和项目的影响。 CR被称为组合优化问题，目的是最大程度地提高整个列表的建议奖励。尽管它很重要，但由于在线环境中的效率，动态和个性化要求，建立实用的CR系统仍然是一个挑战。特别是，我们将问题分为两个子问题，即列表生成和列表评估。新颖和实用的模型体系结构是为这些子问题设计的，旨在共同优化有效性和效率。为了适应在线案例，给出了形成参与者批判性增强框架的自举算法，以探索在长期用户互动中更好的推荐模式。离线和在线实验结果证明了拟议的JDREC框架的功效。 JDREC已应用于在线JD建议中，将点击率提高了2.6％，平台的合成价值提高了5.03％。我们将发布本研究中使用的大规模数据集，以为研究界做出贡献。

如今，在人员重新识别（Reid）任务的真实数据面临隐私问题，例如，禁止DataSet Dukemtmc-Reid。因此，收集Reid任务的真实数据变得更难。同时，标签的劳动力成本仍然很高，进一步阻碍了Reid研究的发展。因此，许多方法转向为REID算法生成合成图像作为替代方而不是真实图像。然而，合成和真实图像之间存在不可避免的领域差距。在以前的方法中，生成过程基于虚拟场景，并且无法根据不同的目标实际场景自动更改其合成训练数据。为了处理这个问题，我们提出了一种新颖的目标感知一代管道，以产生称为Tagerson的合成人物图像。具体地，它涉及参数化渲染方法，其中参数是可控的，并且可以根据目标场景调整。在Tagperson中，我们从目标场景中提取信息，并使用它们来控制我们的参数化渲染过程以生成目标感知的合成图像，这将使目标域中的实图像保持较小的间隙。在我们的实验中，我们的目标感知的合成图像可以实现比MSMT17上的广义合成图像更高的性能，即秩1精度的47.5％与40.9％。我们将发布此工具包\脚注{\ noindent代码可用于\ href {https://github.com/tagperson/tagperson-blender} {https：//github.com/tagperson/tagperson -brender}}为Reid社区以任何所需味道产生合成图像。

风险的准确器官（OAR）分割对于减少治疗后并发症的放射治疗至关重要。达人指南推荐头部和颈部（H＆N）区域的一套超过40桨的桨，然而，由于这项任务的可预测的禁止劳动力成本，大多数机构通过划定较小的桨子和忽视的少数，选择了大量简化的协议与其他桨相关的剂量分布。在这项工作中，我们提出了一种使用深度学习的新颖，自动化和高效的分层OAR分段（SOARS）系统，精确地描绘了一套全面的42 H＆N OAR。 SOARS将42桨分层进入锚，中级和小型和硬质子类别，通过神经结构搜索（NAS）原则，专门为每个类别提供神经网络架构。我们在内在机构中使用176名培训患者建立了SOAR模型，并在六个不同的机构中独立评估了1327名外部患者。对于每个机构评估，它始终如一地表现出其他最先进的方法至少3-5％的骰子得分（在其他度量的相对误差减少36％）。更重要的是，广泛的多用户研究明显证明，98％的SOARE预测只需要非常轻微或没有直接临床验收的修订（节省90％的辐射脑神经工作负载），并且它们的分割和剂量准确度在于或小于帧 - 用户的变化。这些调查结果证实了H＆N癌症放射疗法工作流OAR描绘过程的强烈临床适用性，提高了效率，全面性和质量。

在预先建立的3D环境图中，高精度摄像头重新定位技术是许多任务的基础，例如增强现实，机器人技术和自动驾驶。近几十年来，基于点的视觉重新定位方法已经发达了，但在某些不足的情况下不足。在本文中，我们设计了一条完整的管道，用于使用点和线的相机姿势完善，其中包含创新设计的生产线提取CNN，名为VLSE，线匹配和姿势优化方法。我们采用新颖的线表示，并根据堆叠的沙漏网络自定义混合卷积块，以检测图像上的准确稳定的线路功能。然后，我们采用基于几何的策略，使用表极约束和再投影过滤获得精确的2D-3D线对应关系。构建了以下点线关节成本函数，以通过基于纯点的本地化的初始粗姿势优化相机姿势。在开放数据集（即线框上的线提取器）上进行了足够的实验，在INLOC DUC1和DUC2上的定位性能，以确认我们的点线关节姿势优化方法的有效性。

Blind image quality assessment (BIQA) remains challenging due to the diversity of distortion and image content variation, which complicate the distortion patterns crossing different scales and aggravate the difficulty of the regression problem for BIQA. However, existing BIQA methods often fail to consider multi-scale distortion patterns and image content, and little research has been done on learning strategies to make the regression model produce better performance. In this paper, we propose a simple yet effective Progressive Multi-Task Image Quality Assessment (PMT-IQA) model, which contains a multi-scale feature extraction module (MS) and a progressive multi-task learning module (PMT), to help the model learn complex distortion patterns and better optimize the regression issue to align with the law of human learning process from easy to hard. To verify the effectiveness of the proposed PMT-IQA model, we conduct experiments on four widely used public datasets, and the experimental results indicate that the performance of PMT-IQA is superior to the comparison approaches, and both MS and PMT modules improve the model's performance.

It has been observed in practice that applying pruning-at-initialization methods to neural networks and training the sparsified networks can not only retain the testing performance of the original dense models, but also sometimes even slightly boost the generalization performance. Theoretical understanding for such experimental observations are yet to be developed. This work makes the first attempt to study how different pruning fractions affect the model's gradient descent dynamics and generalization. Specifically, this work considers a classification task for overparameterized two-layer neural networks, where the network is randomly pruned according to different rates at the initialization. It is shown that as long as the pruning fraction is below a certain threshold, gradient descent can drive the training loss toward zero and the network exhibits good generalization performance. More surprisingly, the generalization bound gets better as the pruning fraction gets larger. To complement this positive result, this work further shows a negative result: there exists a large pruning fraction such that while gradient descent is still able to drive the training loss toward zero (by memorizing noise), the generalization performance is no better than random guessing. This further suggests that pruning can change the feature learning process, which leads to the performance drop of the pruned neural network. Up to our knowledge, this is the \textbf{first} generalization result for pruned neural networks, suggesting that pruning can improve the neural network's generalization.

Time-series anomaly detection is an important task and has been widely applied in the industry. Since manual data annotation is expensive and inefficient, most applications adopt unsupervised anomaly detection methods, but the results are usually sub-optimal and unsatisfactory to end customers. Weak supervision is a promising paradigm for obtaining considerable labels in a low-cost way, which enables the customers to label data by writing heuristic rules rather than annotating each instance individually. However, in the time-series domain, it is hard for people to write reasonable labeling functions as the time-series data is numerically continuous and difficult to be understood. In this paper, we propose a Label-Efficient Interactive Time-Series Anomaly Detection (LEIAD) system, which enables a user to improve the results of unsupervised anomaly detection by performing only a small amount of interactions with the system. To achieve this goal, the system integrates weak supervision and active learning collaboratively while generating labeling functions automatically using only a few labeled data. All of these techniques are complementary and can promote each other in a reinforced manner. We conduct experiments on three time-series anomaly detection datasets, demonstrating that the proposed system is superior to existing solutions in both weak supervision and active learning areas. Also, the system has been tested in a real scenario in industry to show its practicality.

As an important variant of entity alignment (EA), multi-modal entity alignment (MMEA) aims to discover identical entities across different knowledge graphs (KGs) with multiple modalities like images. However, current MMEA algorithms all adopt KG-level modality fusion strategies but ignore modality differences among individual entities, hurting the robustness to potential noise involved in modalities (e.g., unidentifiable images and relations). In this paper we present MEAformer, a multi-modal entity alignment transformer approach for meta modality hybrid, to dynamically predict the mutual correlation coefficients among modalities for instance-level feature fusion. A modal-aware hard entity replay strategy is also proposed for addressing vague entity details. Extensive experimental results show that our model not only achieves SOTA performance on multiple training scenarios including supervised, unsupervised, iterative, and low resource, but also has limited parameters, optimistic speed, and good interpretability. Our code will be available soon.

The task of video prediction and generation is known to be notoriously difficult, with the research in this area largely limited to short-term predictions. Though plagued with noise and stochasticity, videos consist of features that are organised in a spatiotemporal hierarchy, different features possessing different temporal dynamics. In this paper, we introduce Dynamic Latent Hierarchy (DLH) -- a deep hierarchical latent model that represents videos as a hierarchy of latent states that evolve over separate and fluid timescales. Each latent state is a mixture distribution with two components, representing the immediate past and the predicted future, causing the model to learn transitions only between sufficiently dissimilar states, while clustering temporally persistent states closer together. Using this unique property, DLH naturally discovers the spatiotemporal structure of a dataset and learns disentangled representations across its hierarchy. We hypothesise that this simplifies the task of modeling temporal dynamics of a video, improves the learning of long-term dependencies, and reduces error accumulation. As evidence, we demonstrate that DLH outperforms state-of-the-art benchmarks in video prediction, is able to better represent stochasticity, as well as to dynamically adjust its hierarchical and temporal structure. Our paper shows, among other things, how progress in representation learning can translate into progress in prediction tasks.